Moore–Penrose inverses of block circulant and block k-circulant matrices
نویسندگان
چکیده
منابع مشابه
Eigenvectors of block circulant and alternating circulant matrices
The eigenvectors and eigenvalues of block circulant matrices had been found for real symmetric matrices with symmetric submatrices, and for block circulant matrices with circulant submatrices. The eigenvectors are now found for general block circulant matrices, including the Jordan Canonical Form for defective eigenvectors. That analysis is applied to Stephen J. Watson’s alternating circulant m...
متن کاملMatrix-free constructions of circulant and block circulant preconditioners
A framework for constructing circulant and block circulant preconditioners (C) for a symmetric linear system Ax= b arising from signal and image processing applications is presented in this paper. The proposed scheme does not make explicit use of matrix elements of A. It is ideal for applications in which A only exists in the form of a matrix vector multiplication routine, and in which the proc...
متن کاملFast circulant block Jacket transform based on the Pauli matrices
Owing to its orthogonality, simplicity of the inversion and fast algorithms, Jacket transform generalising from the Hadamard transform has played important roles in signal and image processing, mobile communication for coding design, cryptography, etc. In this paper, inspired by the emerging block Jacket transform, a new class of circulant block Jacket matrices (CBJMs) are mathematically define...
متن کاملAn Impropriety Test Based on Block-Skew-Circulant Matrices
Since improper (noncircular) complex signals require adequate tools such as widely linear filtering, a generalized likelihood ratio test has been proposed in the literature to verify whether or not a given signal is improper. This test is based on the augmented complex formulation, which is sometimes regarded as the most convenient way of handling improper signals. In this paper, we show that a...
متن کاملAn application of the modified Leverrier-Faddeev algorithm to the singular value decomposition of block-circulant matrices and the spectral decomposition of symmetric block- circulant matrices
The Leverrier-Faddeev algorithm, as modified by Gower (1980), is little-known but is useful for deriving the algebraic, rather than numerical, spectral structure of matrices occurring in statistical methodology. An example is given of deriving explicit forms for the singular value decomposition of any block-circulant matrix and the spectral decomposition of any symmetric block-circulant matrix....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1977
ISSN: 0024-3795
DOI: 10.1016/0024-3795(77)90007-6